Comparing Meseguer's Rewriting Logic with the Logic CRWL

Comparing Meseguer's Rewriting Logic with the Logic CRWL

Meseguer’s rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed with different objectives. Here we study the relationships between them, both at a syntactic and at a semantic level. It is not possible to establish an entailment system map between them, but both can be naturally simulated...

Comparing Meseguer's Rewriting Logic with the Logic Crwl ?

Meseguer's rewriting logic and the rewriting logic CRWL are two well known approaches to rewriting as logical deduction that, despite some clear similarities, were designed with diierent objectives. Here we study the relationships between them, both at a syntactic and at a semantic level. It is not possible to establish an entailment system map between them, but both can be naturally simulated ...

Verification of CRWL Programs with Rewriting Logic

We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-deterministic and partial functions. Our approach transforms functionallogic programs into Maude theories and then uses the Rewriting Logic logical framework to verify properties of the transformed programs. We propose an induc...

Relating Meseguer’s Rewriting Logic with the Constructor-Based Rewriting Logic

Comparing logics for rewriting: rewriting logic, action calculi and tile logic

The large di*usion of concurrent and distributed systems has spawned in recent years a variety of new formalisms, equipped with features for supporting an easy speci-cation of such systems. The aim of our paper is to analyze three proposals, namely rewriting logic, action calculi and tile logic, chosen among those formalisms designed for the description of rule-based systems. For each of these ...